The complexity of counting solutions to Generalised Satisfiability Problems modulo k

نویسنده

  • John Faben
چکیده

Generalised Satisfiability Problems (or Boolean Constraint Satisfaction Problems), introduced by Schaefer in 1978, are a general class of problem which allow the systematic study of the complexity of satisfiability problems with different types of constraints. In 1979, Valiant introduced the complexity class parity P, the problem of counting the number of solutions to NP problems modulo two. Others have since considered the question of counting modulo other integers. We give a dichotomy theorem for the complexity of counting the number of solutions to Generalised Satisfiability Problems modulo integers. This follows from an earlier result of Creignou and Hermann which gave a counting dichotomy for these types of problem, and the dichotomy itself is almost identical. Specifically, counting the number of solutions to a Generalised Satisfiability Problem can be done in polynomial time if all the relations are affine. Otherwise, except for one special case with k = 2, it is #kP-complete.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Generalized Satisfiability Counting Problems

The class of generalized satisfiability problems, introduced in 1978 by Schaefer, presents a uniform way of studying the complexity of satisfiability problems with special conditions. The complexity of each decision and counting problem in this class depends on the involved logical relations. In 1979, Valiant defined the class *P, the class of functions definable as the number of accepting comp...

متن کامل

Two-Variable First Order Logic with Counting Quantifiers: Complexity Results

Etessami, Vardi and Wilke [5] showed that satisfiability of two-variable first order logic FO[<] on word models is Nexptime-complete. We extend this upper bound to the slightly stronger logic FO[<, succ,≡], which allows checking whether a word position is congruent to r modulo q, for some divisor q and remainder r. If we allow the more powerful modulo counting quantifiers of Straubing, Thérien ...

متن کامل

Accidental Algorithms

We provide evidence for the proposition that the computational complexity of individual problems, and of whole complexity classes, hinge on the existence of certain solvable polynomial systems that are unlikely to be encountered other than by systematic explorations for them. We consider a minimalist version of Cook’s 3CNF problem, namely that of monotone planar 3CNF formulae where each variabl...

متن کامل

Modulo Counting on Words and Trees

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a technique for deciding the satisfiability problem. In the case of words this gives a new proof of ExpSpace upper bound, and in the case of trees it gives a ...

متن کامل

Improved Bounds for Exact Counting of Satisfiability Solutions

An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with n variables improves on the previous bound of O(1.2561) by Dahllöf, Jonsson, and Wahlström. The weighted 2-SAT counting algorithm can be applied to obtain faster algorithms for combinatorial counting ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0809.1836  شماره 

صفحات  -

تاریخ انتشار 2008